Splitting Technique Initialization in Local PCA
نویسندگان
چکیده
منابع مشابه
RPCL-Based Local PCA Algorithm
Mining local structure is important in data analysis. Gaussian mixture is able to describe local structure through the covariance matrices, but when used on highdimensional data, fitly specifying such a large number of d(d + 1)=2 free elements in each covariance matrix is difficult. In this paper, by constraining the covariance matrix in decomposed orthonormal form, we propose a Local PCA algor...
متن کاملInitialization Technique in Variable and Multiple Target Tracking Systems
We present initialization of targets in multiple and variable number of target-tracking systems (where targets maneuver dynamically with random accelerations) in this paper where especially, received signal strength (RSS) model sensors are applied in wireless sensor networks. RSS measurement model does not allow to form one to one mapping between states and observations (or measurement). Based ...
متن کاملImage Fusion using Hybrid Technique (PCA + SWT)
Image fusion is to reduce uncertainty and minimize redundancy. It is a process of combining the relevant information from a set of images, into a single image, wherein the resultant fused image will be more informative and complete than any of the input images. Till date the image fusion techniques were like DWT or pixel based. These conventional techniques were not that efficient and they did ...
متن کاملAnalysis of Robust PCA via Local Incoherence
We investigate the robust PCA problem of decomposing an observed matrix into the sum of a low-rank and a sparse error matrices via convex programming Principal Component Pursuit (PCP). In contrast to previous studies that assume the support of the error matrix is generated by uniform Bernoulli sampling, we allow non-uniform sampling, i.e., entries of the low-rank matrix are corrupted by errors ...
متن کاملDistance functions for local PCA methods
The NGPCA method, a combination of the robust neural gas vector quantization method and a fast neural principal component analyzer, has proved to be a valuable tool for the generalized learning of high–dimensional data. At its core, the method uses a competitive ranking to adapt its units. The competition is guided by a specialized distance function — known as the normalized Mahalanobis distanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2006
ISSN: 1549-3636
DOI: 10.3844/jcssp.2006.53.58